A note on the edge cover number and independence number in hypergraphs
نویسندگان
چکیده
Consider a hypergraph of rank r > 2 with m edges, independence number and edge cover number . We prove the inequality (r − 2)m+ r − 1 . One application of this inequality is a special case of a conjecture of Aharoni and the first author extending Ryser’s Conjecture to matroids. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملUnderstorey bird responses to the edge-interior gradient in an isolated tropical rainforest of Malaysia
Forest fragmentation results in a loss of forest interior and an increase in edge habitat. We studied how understorey bird community composition and habitat variables changed along an edge-to-interior gradient in a 1248-ha lowland rainforest patch in peninsular Malaysia. Birds and environmental variables such as vegetation structure and litter depth were detected within a 25-m radius of each of...
متن کاملBicoloring covers for graphs and hypergraphs
Let the bicoloring cover number χ(G) for a hypergraph G(V,E) be the minimum number of bicolorings of vertices of G such that every hyperedge e ∈ E of G is properly bicolored in at least one of the χ(G) bicolorings. We establish a tight bound for χ(K n), where K n is the complete k-uniform hypergraph on n vertices. We investigate the relationship between χ(G), matchings, hitting sets, α(G)(indep...
متن کاملMixed Roman domination and 2-independence in trees
Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacentor incident to at least one element $yin Vcup E$ for which $f(y)=2$. The weight of anMRDF $f$ is $sum _{xin Vcup E} f(x)$. The mi...
متن کاملA Note on Intersecting Hypergraphs with Large Cover Number
We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r − 4 for all but finitely many r. This answers a question of Abu-Khazneh, Barát, Pokrovskiy and Szabó, and shows that a long-standing unsolved conjecture due to Ryser is close to being best possible for every value of r.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008